Coherent sequences versus Radin sequences

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coherent Sequences versus Radin Sequences

We attempt to make a connection between the sequences of measures used to deene Radin forcing and the coherent sequences of ex-tenders which are the basis of modern inner model theory. We show that in certain circumstances we can read oo sequences of measures as deened by Radin from coherent sequences of extenders, and that we can deene Radin forcing directly from a coherent extender sequence a...

متن کامل

I. Coherent Sequences

I Coherent Sequences 3 by Stevo Todorcevic 1 The Space of Countable Ordinals . . . . . . . . . . . . . . . . . . 4 2 Subadditive Functions . . . . . . . . . . . . . . . . . . . . . . . . 12 3 Steps and Coherence . . . . . . . . . . . . . . . . . . . . . . . . . 19 4 The Trace and the Square-Bracket Operation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 5 A Square-Bracket Ope...

متن کامل

Specimens versus sequences.

www.sciencemag.org SCIENCE VOL 323 27 MARCH 2009 1641 COVER False-color, aberration-corrected transmission electron microscope image of a suspended single atomic layer of graphene. When an electron beam induces ejection of an atom from the edge of an intentionally made ~3-nm hole (black), the hole enlarges; the remaining edge carbon atoms rearrange from perfect hexagons into predicted metastabl...

متن کامل

Toeplitz transforms of Fibonacci sequences

We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.

متن کامل

On Runs in Independent Sequences

Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1994

ISSN: 0168-0072

DOI: 10.1016/s0168-0072(94)90010-8